Algebraic Irrational Binary Numbers Cannot Be Fixed Points of Non-trivial Constant Length or Primitive Morphisms
نویسندگان
چکیده
How random are the digits of an algebraic irrational number in a given base? A common conjectured answer to this vague question is that these digits are ``really random.'' For example, define a normal number in base k 2 to be a real number x such that, for each integer d 1, each block of length d occurs in the k-ary expansion of x with frequency 1 k. A widely believed conjecture is that an algebraic irrational number is a normal number in each base k 2. This conjecture is open and seems really out of reach. An alternative formulation of this idea is that the digits occurring in the k-ary expansion of an algebraic irrational number cannot be obtained via a simple algorithm. For example the Champernowne number is obtained by concatenating the decimal expansions of the consecutive integers, i.e.,
منابع مشابه
MAXIMAL PRYM VARIETY AND MAXIMAL MORPHISM
We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.
متن کاملOn the Bits Counting Function of Real Numbers
Let Bn(x) denote the number of 1’s occuring in the binary expansion of an irrational number x > 0. A difficult problem is to provide non-trivial lower bounds for Bn(x) for interesting number numbers like √ 2, e or π: their conjectural simple normality in base 2 is equivalent to Bn(x) ∼ n/2. In this article, amongst other things, we prove inequalities relating Bn(x+y), Bn(xy) and Bn(1/x) to Bn(x...
متن کاملOn the complexity of algebraic numbers I. Expansions in integer bases
Let b ≥ 2 be an integer. We prove that the b-ary expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. Our main tool is a new, combinatorial transcendence criterion.
متن کامل. C O ] 1 4 Ju n 20 01 Palindrome complexity
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...
متن کامل1 4 Ju n 20 01 Palindrome complexity
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998